Howell designs of type H(P − 1, P + 1)

Howell Designs with Sub-designs

A Howell design of side s and order 2n, or more briefly an H(s, 2n), is an s x s array in which each cell is either empty or contains an unordered pair of elements from some (2n)-set V such that (1) every element of V occurs in precisely one cell of each row and each column, and (2) every unordered pair of elements from V is in at most one cell of the array. It follows immediately from the defi...

Sequencings and Howell Designs

Path designs P(v, 3, 1) and P(v, 4, 1) with ovals

In this paper we give a complete solution of the problem of path designs P(v,3,l) and P(v,4,1) having an oval.

The Existence of Howell Designs of Even Side

Intersections among P ( 3 ) ( 2 , 4 ) - Designs 1

A path-hypergraph P (3)(2, 4) is the uniform hypergraph of rank 3, having four vertices and two edges, with exactly two vertices in common. In this paper, the intersection problem among P (3)(2, 4)-designs of order v is studied and completely solved for every admissible v. Mathematics Subject Classification: 05B05